Minimizing Slope Change in Imprecise 1.5D terrains
نویسندگان
چکیده
A 1.5D terrain is an x-monotone polyline with n vertices. An imprecise 1.5D terrain is a 1.5D terrain with a y-interval at each vertex, rather than a fixed y-coordinate. A realization of an imprecise terrain is a sequence of n y-coordinates—one for each interval— such that each y-coordinate is within its corresponding interval. For certain applications in terrain analysis, it is important to be able to find a realization of an imprecise terrain that is smooth. In this paper we model smoothness by considering the change in slope between consecutive edges of the terrain. The goal is to find a realization of the terrain where the maximum slope change is minimized. We present an exact algorithm that runs in O(n) time.
منابع مشابه
Smoothing Imprecise 1.5D Terrains
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کاملSmoothing Imprecise 1.5d Teeeains *
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کاملVisibility-based Distributed Deployment of Robotic Teams in Polyhedral Terrains
This paper presents deployment strategies for a team of multiple mobile robots with line-of-sight visibility in 1.5D and 2.5D terrain environments. Our objective is to distributively achieve full visibility of a polyhedral environment. In the 1.5D polyhedral terrain, we achieve this by determining a set of locations that the robots can distributively occupy. In the 2.5D polyhedral terrain, we a...
متن کاملVC-Dimension of Visibility on Terrains
A guarding problem can naturally be modeled as a set system (U ,S) in which the universe U of elements is the set of points we need to guard and our collection S of sets contains, for each potential guard g, the set of points from U seen by g. We prove bounds on the maximum VC-dimension of set systems associated with guarding both 1.5D terrains (monotone chains) and 2.5D terrains (polygonal ter...
متن کاملTerrain Visibility with Multiple Viewpoints
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in...
متن کامل